New bounds for the controller problem
نویسندگان
چکیده
منابع مشابه
the algorithm for solving the inverse numerical range problem
برد عددی ماتریس مربعی a را با w(a) نشان داده و به این صورت تعریف می کنیم w(a)={x8ax:x ?s1} ، که در آن s1 گوی واحد است. در سال 2009، راسل کاردن مساله برد عددی معکوس را به این صورت مطرح کرده است : برای نقطه z?w(a)، بردار x?s1 را به گونه ای می یابیم که z=x*ax، در این پایان نامه ، الگوریتمی برای حل مساله برد عددی معکوس ارانه می دهیم.
15 صفحه اولNew Bounds for the Language Compression Problem
The CD complexity of a stringx is the length of the shortest polynomial time program which accepts only the string x. The language compression problem consists of giving an upper bound on the CDA n complexity of all strings x in some set A. The best known upper bound for this problem is 2 log(jjA njj) + O(log(n)), due to Buhrman and Fortnow. We show that the constant factor 2 in this bound is o...
متن کاملNew Bounds for the Balloon Popping Problem
In digital goods auctions, also known as unlimited supply auctions, an auctioneer sells a collection of identical items to unit-demand bidders. As usual in this setting, when getting the item, a bidder experiences a certain utility which is unknown to the auctioneer. Given this restriction, the auctioneer wants to design a mechanism, i.e., a set of auction rules, so as to raise as much revenue ...
متن کاملNew Lower Bounds for Hopcroft's Problem
We establish new lower bounds on the complexity of the following basic geometric problem, attributed to John Hopcroft: Given a set of n points and m hyperplanes in IR, is any point contained in any hyperplane? We de ne a general class of partitioning algorithms, and show that in the worst case, for all m and n, any such algorithm requires time (n logm + nm + m logn) in two dimensions, or (n log...
متن کاملNew Bounds for the Snake-in-the-Box Problem
The Snake-in-the-Box problem is that of finding a longest induced path in an n-dimensional hypercube. We prove new lower bounds for the values n ∈ {11, 12, 13}. The Coil-in-the-Box problem is that of finding a longest induced cycle in an n-dimensional hypercube. We prove new lower bounds for the values n ∈ {12, 13}.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Distributed Computing
سال: 2010
ISSN: 0178-2770,1432-0452
DOI: 10.1007/s00446-010-0119-z